巨型机环境下UNIX逻辑盘的实现

本文针对巨型机的体系结构特点,对UNIX逻辑设备概念进行了扩充,引入巨型机逻辑盘的概念,给出了一种逻辑盘的实现。逻辑盘的概念使得文件系统的大小独立于物理盘的容量、支持巨型文件或巨型文件系统。     

人才结构系统分析的目标规划方法

本文把马尔可夫过程和目标规划结合起来,提出人才结构系统分析的单项控制和多项控制,并在单项控制模型的基础上发展成了多项控制模型,加强了模型的可信度和通用性。     

最小、最大广义最优停止规则的特征

设(X_n,F_n)_1~∞是适应的报酬序列,(γ_n)是相应的snell 包,(A_n)是(γ_n)的Doob-Meyer 分解中零初值的可料增过程。本文继J.Klass 的研究证明了σ_1=inf{K≥1:X_k≥γ_k}是最小半最优的且是最大严格正则的广义规则,而K_0=sup{n≥0:A_n=0}<∞是最大正则的广义规则,从而得出了广义最优规则唯一性的另一表述。     

On the availability of R out of N repairable systems

An R out of N repairable system consisting of N components and operates if at least R components are functioning. Repairable means that failed components are repaired, and upon repair completion they are as good as new. We derive formulas for the expected up‐time, expected down‐time, and the availability of the system, using Markov renewal processes. We assume that either the repair times of the components are generally distributed and the components' lifetimes are exponential or vice versa. The analysis is done for systems with either cold or warm stand‐by. Numerical examples are given for several life time and repair time distributions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 483–498, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10025     

煤制油工业火灾扑救探析

简述了煤制油的发展历程,分析了煤制油工业的火灾危险性和火灾特点,初步总结和探讨了煤制油工业火灾的扑救方法,对引发的相关问题作了一些思考。     

浅谈培养解题能力

从深刻理解数学概念内涵、熟悉数学公式及变式和注重解题过程分析三个方面谈如何有效培养学生的解题能力 ,进而促进学生数学能力的发展     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.     

Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

过程挖掘算法

过程挖掘又称工作流挖掘,主要依据日志中记录的过程实例执行信息重构工作流过程模型,是工作流再设计与分析方法的一项关键技术。对目前主流的过程挖掘算法和相关工具进行了研究,把过程挖掘算法按照特性及解决问题分成了4类,对每类算法的优缺点进行比较研究。最后指出了目前过程挖掘研究中存在的问题。     

ISDT算法的数据压缩处理及其性能分析

过程数据的实时压缩和趋势提取可以显著提高过程控制系统的整体性能.传统的SDT数据压缩算法不能很好地适应现今过程控制的要求,无法获得满意的压缩结果.针对SDT算法的弊端,提出了一种改进的SDT数据压缩算法,并进行了两种算法的性能对比.对合成数据仿真计算的分析结果表明,基于ISDT算法的过程数据压缩性能有大幅度的提高,更好地满足了现今过程控制中实时数据处理和趋势分析的要求.